Acyclicity of Switching Classes
نویسندگان
چکیده
منابع مشابه
Acyclicity of Switching Classes
For a nite undirected graph G = (V;E) and a subset A V , the vertexswitching of G by A is de ned as the graph G A = (V;E 0 ), which is obtained from G by removing all edges between A and its complement A and adding as edges all nonedges between A and A. A switching class [G] determined by G consists of all vertex-switchings G A for subsets A V . We prove that the trees of a switching class [G] ...
متن کاملOn Perfect Switching Classes
We study a graph transformation (defined by Seidel) called switching which, given a graph G = ( V,E) and a subset W C Jf of its vertices, builds a new graph by exchanging the cocycle linking W to V\ W with its complement. Switching is an equivalence relation and the associated equivalence classes are called switching classes. A switching class is perfect if it contains only perfect graphs. We s...
متن کاملRainbow Graphs and Switching Classes
A rainbow graph is a graph that admits a vertex-coloring such that every color appears exactly once in the neighborhood of each vertex. We investigate some properties of rainbow graphs. In particular, we show that there is a bijection between the isomorphism classes of n-rainbow graphs on 2n vertices and the switching classes of graphs on n vertices.
متن کاملFinite metrics in switching classes
Let D be a finite set and g : D × D → R a symmetric function satisfying g(x, x) = 0 and g(x, y) = g(y, x) for all x, y ∈ D. A switch gσ is obtained from g by using a local valuation σ : D → R: gσ(x, y) = σ(x) + g(x, y) + σ(y) for x 6= y. It is shown that every symmetric function g has a unique minimal pseudometric switch, and, moreover, there is a switch gσ of g that is isometric to a finite Ma...
متن کاملOn the Relationship of Joint Acyclicity and Super-Weak Acyclicity
Rules that allow existential quantifiers in the head (conclusion) have been studied extensively in knowledge representation, databases, and logic programming (in the related form of logic programs with function symbols). In general, it is not decidable if a set of such rules admits a finite model, but a number of sufficient conditions have been proposed to detect situations where this is the ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1998
ISSN: 0195-6698
DOI: 10.1006/eujc.1997.0191